decoding complexity中文是什么意思

• 译码复杂性

• "decode"中文翻译    vt. 译码；解码；译出指令。
• "complexity"中文翻译    n. 1.复杂性，复合状态。 2.复合物；复杂的事物[情 ...
• "complexity" 中文翻译 :    n. 1.复杂性，复合状态。 2.复合物；复杂的事物[情况]。
• "decoding" 中文翻译 :    解解码; 解密; 译出; 译码
• "advancing complexity" 中文翻译 :    进化综合
• "algorithm complexity" 中文翻译 :    算法复杂性
• "algorithmic complexity" 中文翻译 :    算法复杂性
• "asymptotic complexity" 中文翻译 :    渐近复杂性
• "aufwand complexity" 中文翻译 :    复杂性
• "business complexity" 中文翻译 :    业务复杂性
• "chemical complexity" 中文翻译 :    化学复杂度
• "circuit complexity" 中文翻译 :    电路复杂性
• "clonal complexity" 中文翻译 :    克隆复杂性
• "code complexity" 中文翻译 :    代码复杂性
• "cognitive complexity" 中文翻译 :    认知复杂性
• "complexity analysis" 中文翻译 :    成分分析
• "complexity class" 中文翻译 :    复杂度类; 复杂性类
• "complexity factor" 中文翻译 :    复杂度系数; 复杂性因子; 复杂性指示; 复杂因数
• "complexity graph" 中文翻译 :    复杂性图形
• "complexity measure" 中文翻译 :    复杂性度量
• "complexity metrics" 中文翻译 :    复杂性度量
• "complexity of computation" 中文翻译 :    计算的复杂性; 计算复杂性
• "complexity of computing" 中文翻译 :    计算复杂性
• "complexity of emotion" 中文翻译 :    情绪的复杂性
• "complexity of interface" 中文翻译 :    接口复杂性

• Designing codes with approaching shannon ' s capacity performance and low coding and decoding complexity is a challenging and meaningful issue in channel coding field
  设计性能逼近信道容量、编译码复杂度较低的实用好码是信道编码领域中最重要的工作之一。
• Turbo code was introduced by c . berrou in 1993 . turbo code can achieve the error correcting capacity close to the shannon - limit with reasonable decoding complexity , provided that the code words are long enough
  1993年, c . berrou提出了一种新的信道编码方案? ? turbo码, turbo码能够在编码长度较长的情况下得到接近香农极限的纠错性能。
• Its decoding complexity is also lower than turbo code . recently , ldpc code has drawn the worldwide attentions in channel coding community due to its high performance and strong potential applications in practice
  Ldpc码的数学定义非常简单,具有较大的灵活性,当码长足够长时的非正规ldpc码具有比turbo码更为良好的性能,其译码复杂度低于turbo码。
• Low density parity check ( ldpc ) codes are shown to be one class of shannon limit approaching codes . with advantages of high encoding gain , low decoding complexity and flexible code rates , etc . , the research of these codes has become a hot spot of coding academia
  低密度校验码( ldpc )性能接近香农限,具有编码增益高、译码简单快捷、码率灵活等优点,是当前编码界的研究热点。
• 3 . by theoretical analysis and simulation , quantization decoding of ldpc codes is studied . an efficient quantization - decoding scheme is proposed which can greatly reduce the decoding complexity with a little performance loss
  采用理论分析和仿真相结合的方法研究了ldpc码的量化译码，提出了一种高效的量化译码实现方案，该方案能够大大降低译码复杂度，同时译码性能非常接近连续译码。
• Erasure codes which belong to standard classes of rs codes and their erasure correcting principles are introduced with emphasis on cascaded low - density erasure codes with linear time encoding and erasure recover algorithms . the encoding and decoding complexities of these codes are analyzed . 2
  介绍了标准的rs码类纠删码及其纠删原理，重点介绍了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了这几类纠删码的编译码复杂度； 2
• Space - time block codes ( stbc ) based on orthogonal design has attracts enough attentions in its applications in mimo - ofdm systems for its full diversity exploiting and low coding / decoding complexity . these applications include not only system performance improvement , but also reduction of the peak to average power ratio in mimo - ofdm systems . under these backgrounds , this paper first studies space - time block codes under the single carrier , flat fading situation , discusses the encoding / decoding principle and its performance under different channels . then , the author focused on the performance of space - time codes under time selective and frequency selective channels , uncovered the fundamental cause of how maximum doppler shift and power delay profile influences the performance of space - time codes through deduction and simulation
  在上述背景下,本文以单载波,平坦衰落信道下的空时分组码为切入点,深入分析了其编译码原理和在不同信道情况下的性能;以此为基础,后文展开了对空时分组码在多载波,时间选择性和频率选择性衰落信道下的性能研究,通过理论推导和充分的仿真,揭示了空时/频分组码在时频选择性衰落信道中的性能变化的根本原因;在以上对多载波系统中空时分组码的研究的过程中,作者发现了空时分组码在降低系统峰平比方面应用的可行性,提出了一种降低峰平比的新方法。
• In this paper , the constraint viterbi algorithm is studied from the project research on a novel product code and decode which is a project of national natural science foundation of china , experiment results show that it can overcome the drawback and reduce the decoding complexity while keeping the good characteristic of conventional viterbi algorithm
  本文所研究的约束维特比算法基于国家科学基金项目《新一代乘积编码( productcode )及解码方法的研究》 ,不但保持了原有维特比算法的特性,而且在减少译码路径的情况下,能较好地解决上述问题。